A K Counterexample Machine

نویسنده

  • CHRISTOPHER HOFFMAN
چکیده

We present a general method for constructing families of measure preserving transformations which are K and loosely Bernoulli with various ergodic theoretical properties. For example, we construct two K transformations which are weakly isomorphic but not isomorphic, and a K transformation with no roots. Ornstein’s isomorphism theorem says families of Bernoulli shifts cannot have these properties [6]. The construction uses a combination of properties from maps constructed by Ornstein and Shields, and Rudolph, and reduces the question of isomorphism of two transformations to the conjugacy of two related permutations [10][13].

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

SAT Based Abstraction-Refinement Using ILP and Machine Learning Techniques

ion-Refinement 1. Generate an initial abstraction function h. 2. Build abstract machine M̂ based on h. Model check M̂ . If M̂ |= φ, then M |= φ. Return TRUE. 3. If M̂ 6|= φ, check the counterexample on the concrete model. If the counterexample is real, M 6|= φ. Return FALSE. 4. Refine h, and go to step 2. SAT based Abstraction-Refinement using ILP and Machine Learning Techniques 13 Abstraction Func...

متن کامل

Minimization of Counterexamples in SPIN

We propose an algorithm to find a counterexample to some property in a finite state program. This algorithm is derived from SPIN’s one, but it finds a counterexample faster than SPIN does. In particular it still works in linear time. Compared with SPIN’s algorithm, it requires only one additional bit per state stored. We further propose another algorithm to compute a counterexample of minimal s...

متن کامل

On the Exact Learnability of Graph Parameters: The Case of Partition Functions

We study the exact learnability of real valued graph parameters f which are known to be representable as partition functions which count the number of weighted homomorphisms into a graph H with vertex weights α and edge weights β. M. Freedman, L. Lovász and A. Schrijver have given a characterization of these graph parameters in terms of the k-connection matrices C(f, k) of f . Our model of lear...

متن کامل

A Counterexample to the Robust and Anti-luck Virtue Epistemologies

This paper begins with an introduction to four different prominent versions of process reliabilism about knowledge, namely, the simple K-reliabilism, John Greco’s robust virtue epistemology, Duncan Pritchard’s anti-luck virtue epistemology, and the Goldmanian Kreliabilism. Its main objective is to offer a counterexample, namely, the fewer barn façades case, to the anti-luck virtue epistemology,...

متن کامل

On the algebraicity of generalized power series

Let K be an algebraically closed field of characteristic p. We exhibit a counterexample against a theorem asserted in one of our earlier papers, which claims to characterize the integral closure of K((t)) within the field of Hahn-Mal’cev-Neumann generalized power series. We then give a corrected characterization, generalizing our earlier description in terms of finite automata in the case where...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999